Characterizing congruence preserving functions $Z/nZ\to Z/mZ$ via rational polynomials
نویسندگان
چکیده
We introduce a basis of rational polynomial-like functions P 0 ,. .. , P n−1 for the free module of functions Z/nZ → Z/mZ. We then characterize the subfamily of congruence preserving functions as the set of linear combinations of the functions lcm(k) P k where lcm(k) is the least common multiple of 2,. .. , k (viewed in Z/mZ). As a consequence , when n ≥ m, the number of such functions is independent of n.
منابع مشابه
CHARACTERIZING CONGRUENCE PRESERVING FUNCTIONS Z/nZ → Z/mZ VIA RATIONAL POLYNOMIALS
Using a simple basis of rational polynomial-like functions P0, . . . , Pn−1 for the free module of functions Z/nZ → Z/mZ, we characterize the subfamily of congruence preserving functions as the set of linear combinations of the products lcm(k)Pk where lcm(k) is the least common multiple of 2, . . . , k (viewed in Z/mZ). As a consequence, when n ≥ m, the number of such functions is independent o...
متن کاملArithmetical Congruence Preservation: From Finite to Infinite
Various problems on integers lead to the class of functions defined on a ring of numbers (or a subset of such a rings) METTRE RING AU SINGULIER and verifying a − b divides f(a) − f(b) for all a, b. We say that such functions are “congruence preserving”. In previous works, we characterized these classes of functions for the cases N → Z, Z→ Z and Z/nZ→ Z/mZ in terms of sums series of rational pol...
متن کاملA ug 2 00 6 Search techniques for root - unitary polynomials
We give an anecdotal discussion of the problem of searching for polynomials with all roots on the unit circle, whose coefficients are rational numbers subject to certain congruence conditions. We illustrate with an example from a calculation in p-adic cohomology made by Abbott, Kedlaya, and Roe, in which (using an implementation developed with Andre Wibisono) we recover the zeta function of a s...
متن کاملComputing modular polynomials in quasi-linear time
We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions and on interpolation, which has received little attention in the literature, has a complexity that is essentially (up to logarithmic factors) linear in the size of the computed polynomials. In particular, it obtains th...
متن کاملCongruence Subgroups of the Automorphism Group of a Free Group
Let n ≥ 2 and Fn be the free group of rank n. Its automorphism group Aut(Fn) has a well-known surjective linear representation ρ : Aut(Fn) −→ Aut(Fn/F ′ n) = GLn(Z) where F ′ n denotes the commutator subgroup of Fn. By Aut (Fn) := ρ(SLn(Z)) we denote the special automorphism group of Fn. For an epimorphism π : Fn → G of Fn onto a finite group G we call Γ(G, π) := {φ ∈ Aut(Fn) | πφ = π} the stan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1506.00133 شماره
صفحات -
تاریخ انتشار 2015